Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
نویسندگان
چکیده
منابع مشابه
Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملTwo-agent group scheduling with deteriorating jobs on a single machine
This paper considers the two-agent scheduling problems with deteriorating jobs and group technology on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the maximum cost of the second agent cannot exceed a given upper bound. Two agents compete to perform their respective jobs on a common single machine, and each agent has...
متن کاملDue-date assignment and parallel-machine scheduling with deteriorating jobs
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...
متن کاملScheduling Deteriorating Jobs on a Single Processor
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs and a mathematical model based on binary integer programming (BIP) is developed. Since the precedence constraints exist, a job cannot start before completion of its all predecessors. The proposed model consists of two steps: in the first step, the earliest starting time of each job is c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2017
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2017.05.019